Thermodynamics of Computational Copying in Biochemical Systems
نویسندگان
چکیده
منابع مشابه
Thermodynamics of Computational Copying in Biochemical Systems
Living cells use readout molecules to record the state of receptor proteins, similar to measurements or copies in typical computational devices. But is this analogy rigorous? Can cells be optimally efficient, and if not, why? We show that, as in computation, a canonical biochemical readout network generates correlations; extracting no work from these correlations sets a lower bound on dissipati...
متن کاملThe thermodynamics of computational copying in biochemical systems
Living cells use readout molecules to record the state of cell-surface receptors that detect ligands in their environment. On the surface, these readouts appear similar to measurements made by computational devices, as extensively studied in the literature following Maxwell’s demon. But at what level do measurements made by biochemical devices map onto computational measurements made, for examp...
متن کاملThermodynamics and Kinetics of Spiro-Heterocycle Formation Mechanism: Computational Study
Reaction mechanism among indoline-2,3-dione, pyrrolidine-2-carboxylic acid and (Z)-2-(1-(2-hydroxynaphthalen-1-yl)ethylidene)hydroxycarboxamide to form 1’-((((aminooxy)carbonyl)amino)methyl)-2’-(1-hydroxynaphthalen-2-yl)-2’-methyl-1’,2’,5’,6’,7’,7a’-hexahydrospiro[indoline-3,3’-pyrrolo[1,2-a]imidazole-2-one was investigated using density functional theory (DFT) at B3LYP basis theory. The three-...
متن کاملComputational Thermodynamics
We test the functionality of FEniCS on the challenge of computational thermodynamics in the form of the EG2 finite element solver of the Euler equations expressing conservation of mass, momentum and energy. We show that computational solutions satisfy a 2nd Law formulated in terms of kinetic energy, internal (heat) energy, work and shock/turbulent dissipation, without reference to entropy. We s...
متن کاملBit Copying - The Ultimate Computational Simplicity
This paper presents a proof that referencing and bit copying operations are sufficient for Turing-complete computation. A programming language consisting of just one instruction – bit copy, is presented. This language is powerful enough to run programs such as “Hello, World!” with iterations over an array and calculating factorials. The idea is that the computation is done without logic operati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review X
سال: 2017
ISSN: 2160-3308
DOI: 10.1103/physrevx.7.021004